How to Revise a Total Preorder

نویسندگان

  • Richard Booth
  • Thomas Andreas Meyer
چکیده

Most approaches to iterated belief revision are accompanied by some motivation for the use of the proposed revision operator (or family of operators), and typically encode enough information in the epistemic state of an agent for uniquely determining one-step revision. But in those approaches describing a family of operators there is usually little indication of how to proceed uniquely after the first revision step. In this paper we contribute towards addressing that deficiency by providing a formal framework which goes beyond the first revision step in two ways. First, the framework is obtained by enriching the epistemic state of an agent starting from the following intuitive idea: we associate to each world x two abstract objects x and x, and we assume that, in addition to preferences over the set of worlds, we are given preferences over this set of objects as well. The latter can be considered as meta-information encoded in the epistemic state which enables us to go beyond the first revision step of the revision operator being applied, and to obtain a unique set of preferences over worlds. We then extend this framework to consider, not only the revision of preferences over worlds, but also the revision of this extended structure itself. We look at some desirable properties for revising the structure and prove the consistency of these properties by giving a concrete operator satisfying all of them. Perhaps more importantly, we show that this framework has strong connections with two other types of constructions in related areas. Firstly, it can be seen as a special case of preference aggregation which opens up the possibility of extending the framework presented here into a full-fledged framework for preference aggregation and social choice theory. Secondly, it is related to existing work on the use of interval orderings in a number of different contexts. Note: This paper is a combined and extended version of papers which first appeared in the proceedings of KR 2006, the 10th International Conference on Principles of Knowledge Representation and Reasoning [8], and ECSQARU 2007, the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty [10].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Revising Partial Pre-Orders with Partial Pre-Orders: A Unit-Based Revision Framework

Belief revision studies strategies about how agents revise their belief states when receiving new evidence. Both in classical belief revision and in epistemic revision, a new input is either in the form of a (weighted) propositional formula or a total pre-order (where the total pre-order is considered as a whole). However, in some real-world applications, a new input can be a partial pre-order ...

متن کامل

A Bad Day Surfing Is Better than a Good Day Working: How to Revise a Total Preorder

Most approaches to iterated belief revision are accompanied by some motivation for the use of the proposed revision operator (or family of operators), and typically encode enough information for uniquely determining one-step revision. But in those approaches describing a family of operators, there is usually little indication of how to proceed uniquely after the first revision step. In this pap...

متن کامل

A novel algorithm to determine the leaf (leaves) of a binary tree from its preorder and postorder traversals

Binary trees are essential structures in Computer Science. The leaf (leaves) of a binary tree is one of the most significant aspects of it. In this study, we prove that the order of a leaf (leaves) of a binary tree is the same in the main tree traversals; preorder, inorder, and postorder. Then, we prove that given the preorder and postorder traversals of a binary tree, the leaf (leaves) of a bi...

متن کامل

Simulation Preorder on Simple Process Algebras

We consider the problem of simulation preorder/equivalence between infinite-state processes and finite-state ones. We prove that simulation preorder (in both directions) and simulation equivalence are intractable between all major classes of infinite-state systems and finite-state ones. This result is obtained by showing that the problem whether a BPA (or BPP) process simulates a finitestate on...

متن کامل

Preorder Relators and Generalized Topologies

In this paper we investigate generalized topologies generated by a subbase of preorder relators and consider its application in the concept of the complement. We introduce the notion of principal generalized topologies obtained from the new type of open sets and study some of their important properties.

متن کامل

آیا پیشرفت تحصیلی دانشجویان ارتباطی با گذراندن کلاس های فوق العاده آموزشی قبل از ورود به دانشگاه دارد؟

Introduction: Academic achievement of students is one of the important indicators of education. Hence study variables that are related to academic achievement in different subjects, is one of the main topics of research in Education system. this study performed in order to asses the association of student‘s education progress with Additional classes before passing entrance exam. Material and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Philosophical Logic

دوره 40  شماره 

صفحات  -

تاریخ انتشار 2011